A Case Study In Implementing Dependency-Based Grammars
نویسندگان
چکیده
In creating an English grammar checking software product, we implemented a large-coverage grammar based on the dependency grammar formalism. This implementat ion required some adaptation of current linguistic description to prevent serious overgeneration of parse trees. Here, • we present one particular example, that of preposition stranding and dangling prepositions, where implementing an alternative to existing linguistic analyses is warranted to limit such overgeneration.
منابع مشابه
Writing Weighted Constraints for Large Dependency Grammars
Implementing dependency grammar as a set of defeasible declarative rules has fundamental advantages such as expressiveness, automatic disambiguation, and robustness. Although an implementation and a successful large-scale grammar of German are available, so far the construction of constraint dependency grammars has not been described at length. We report on techniques that were used to write th...
متن کاملDependency grammars as Haskell programs
In the paper we try to show that a lazy functional language such as Haskell is a convenient framework not only for implementing dependency parsers but also for expressing dependency grammars directly in the programming language in a compact, readable and mathematically clean way. The parser core, supplying necessary types and functions, is presented together with two examples of grammars: one t...
متن کاملDependency Unification Grammar for PROLOG
The programming language PROLOG has proved to be an excellent tool for implementing natural language processing systems. Its built-in resolution and unification mechanisms are well suited to both accept and generate sentences of artificial and natural languages. Although supporting many different linguistic formalisms, its straightforwardness and elegance have perhaps best been demonstrated wit...
متن کاملThe Complexity of Recognition of Linguistically Adequate Dependency Grammars
Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of li...
متن کاملAutomatic Cross-Lingual Similarization of Dependency Grammars for Tree-based Machine Translation
Structural isomorphism between languages benefits the performance of cross-lingual applications. We propose an automatic algorithm for cross-lingual similarization of dependency grammars, which automatically learns grammars with high cross-lingual similarity. The algorithm similarizes the annotation styles of the dependency grammars for two languages in the level of classification decisions, an...
متن کامل